Vague Logic Approach to Disk Scheduling

Vague sets theory separates the evidences in favour and against of an element in a set which provides better mechanism to handle impreciseness and uncertainty. This research paper aims to handle the incompleteness and impreciseness of data associated with the disk access requests. Here, we propose a new disk scheduling algorithm, Vague Disk Scheduling (VDS) Algorithm, based on vague logic. The proposed framework includes Vague-Fuzzification Technique, Priority Expression, and VDS Algorithm. The VagueFuzzification Technique is applied to the input data of each disk access request and generates a priority for each request in the queue. Based on the priority allotted the requests are serviced. Finally work is evaluated on different datasets and finally compared with Fuzzy Disk Scheduling (FDS) Algorithm. The results prove that VDS algorithm performs better than FDS Algorithm.